package com.spirng.leetcode.day10;

public class Test509 {
    public static void main(String[] args) {
        Test509 test509 = new Test509();
        test509.fib(2);
    }
    public int fib(int n) {
        if(n<=1)return n;
        int [] dp=new int[n+1];
        dp[0]=0;
        dp[1]=1;
        for (int i=2;i<=n;i++){
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
    public int fib1(int n) {
        if(n<=1) {
            return n;
        }
        return fib1(n-1)+fib1(n-2);
    }
}
